Testing of embedding with margin for discrete random sequences
نویسندگان
چکیده
منابع مشابه
T-S FUZZY MODEL-BASED MEMORY CONTROL FOR DISCRETE-TIME SYSTEM WITH RANDOM INPUT DELAY
A memory control for T-S fuzzy discrete-time systems with sto- chastic input delay is proposed in this paper. Dierent from the common assumptions on the time delay in the existing literatures, it is assumed in this paper that the delays vary randomly and satisfy some probabilistic dis- tribution. A new state space model of the discrete-time T-S fuzzy system is derived by introducing some stocha...
متن کاملTest embedding with discrete logarithms
When using Built-In Self Test (BIST) for testing VLSI circuits, a major concern is the generation of proper test patterns that detect the faults of interest. Usually a linear feedback shift register (LFSR) is used to generate test patterns. We rst analyze the probability that an arbitrary pseudo-random test sequence of short length detects all faults. The term short is relative to the probabili...
متن کاملFURTHER RESULTS OF CONVERGENCE OF UNCERTAIN RANDOM SEQUENCES
Convergence is an issue being widely concerned about. Thus, in this paper, we mainly put forward two types of concepts of convergence in mean and convergence in distribution for the sequence of uncertain random variables. Then some of theorems are proved to show the relations among the three convergence concepts that are convergence in mean, convergence in measure and convergence in distributio...
متن کاملOn the Testing Quality of Random and Pseudo-random Sequences for Permanent and Intermittent Faults
In this paper, the natures of random and pseudo-random input sequences and their influence on permanent and intermittent fault detecting are analyzed. The aliasing fault coverage between the pseudo-random and random sequences is estimated. The activity probability features of the intermittent faults are considered. The selftest circuits of the intermittent faults are illustrated. The experiment...
متن کاملLarge Margin Taxonomy Embedding with an Application to Document Categorization
Applications of multi-class classification, such as document categorization, often appear in cost-sensitive settings. Recent work has significantly improved the state of the art by moving beyond “flat” classification through incorporation of class hierarchies [4]. We present a novel algorithm that goes beyond hierarchical classification and estimates the latent semantic space that underlies the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Prikladnaya diskretnaya matematika. Prilozhenie
سال: 2018
ISSN: 2226-308X
DOI: 10.17223/2226308x/11/3